DEAP: evolutionary algorithms made easy
نویسندگان
چکیده
DEAP is a novel evolutionary computation framework for rapid prototyping and testing of ideas. Its design departs from most other existing frameworks in that it seeks to make algorithms explicit and data structures transparent, as opposed to the more common black-box frameworks. Freely available with extensive documentation at http://deap.gel.ulaval.ca, DEAP is an open source project under an LGPL license.
منابع مشابه
Differential Expression Analysis for Pathways
Life science technologies generate a deluge of data that hold the keys to unlocking the secrets of important biological functions and disease mechanisms. We present DEAP, Differential Expression Analysis for Pathways, which capitalizes on information about biological pathways to identify important regulatory patterns from differential expression data. DEAP makes significant improvements over ex...
متن کاملImplementing Parallel Evolutionary Algorithms in a Distributed Workflow
This paper contains research focused on the utilization of evolutionary algorithms (EAs), specifically the use of the DEAP library, in the environment of an implicitly parallel language. This research was motivated primarily by a desire to allow user to implement parallel EAs without the prerequisite mastery of MPI. The computation of EAs consist of many instances of the same computational oper...
متن کاملSelection of the Most Relevant Physiological Features for Classifying Emotion
With the development of wearable physiological sensors, emotion estimation becomes a hot topic in the literature. Databases of physiological signals recorded during emotional stimulation are acquired and machine learning algorithms are used. Yet, which are the most relevant signals to detect emotions is still a question to be answered. In order to better understand the contribution of each sign...
متن کاملThe Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues
A priority queue is a data type where the element with the smallest key value can be found and deleted, and new elements can be inserted. It is also called a priority queue when the element with the largest key value is wanted, instead of the smallest. In some cases, it is interesting to find and delete both the smallest and the largest element, as well as to be able to insert new elements. A s...
متن کاملGenetic Algorithm Based Floor Planning System
Genetic Algorithms are widely used in many different optimization problems including layout design. The layout of the shelves play an important role in the total sales metrics for superstores since this affects the customers’ shopping behaviour. This paper employed a genetic algorithm based approach to design shelf layout of superstores. The layout design problem was tackled by using a novel ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Machine Learning Research
دوره 13 شماره
صفحات -
تاریخ انتشار 2012